A combination of exact algorithms for inference on Bayesian belief networks
نویسندگان
چکیده
منابع مشابه
A combination of exact algorithms for inference on Bayesian belief networks
Cutset conditioning and clique-tree propagation are two popular methods for exact probabilistic inference in Bayesian belief networks. Cutset conditioning is based on decomposition of a subset of network nodes, whereas clique-tree propagation depends on aggregation of nodes. We characterize network structures in which the performances of these methods differ. We describe a means to combine cuts...
متن کاملCompiling relational Bayesian networks for exact inference
We describe in this paper a system for exact inference with relational Bayesian networks as defined in the publicly available Primula tool. The system is based on compiling propositional instances of relational Bayesian networks into arithmetic circuits and then performing online inference by evaluating and differentiating these circuits in time linear in their size. We report on experimental r...
متن کاملA Bayesian analysis of simulation algorithms for inference in belief networks
A belief network is a graphical representation of the underlying probabilistic relationships in a complex system. Belief networks have been employed as a representation of uncertain relationships in computer-based diagnostic systems. These diagnostic systems provide assistance by assigning likelihoods to alternative explanatory hypotheses in response to a set of ndings or observations. Approxim...
متن کاملApproximating Probabilistic Inference in Bayesian Belief Networks
A belief network comprises a graphical representation of dependencies between variables of a domain and a set of conditional probabilities associated with each dependency. Unless P=NP, an efficient, exact algorithm does not exist to compute probabilistic inference in belief networks. Stochastic simulation methods, which often improve run times, provide an alternative to exact inference algorith...
متن کاملA Stratified Simulation Scheme for Inference in Bayesian Belief Networks
Simulation schemes for probabilistic infer ence in Bayesian belief networks offer many advantages over exact algorithms; for ex ample, these schemes have a linear and thus predictable runtime while exact algo rithms have exponential runtime. Exper iments have shown that likelihood weight ing is one of the most promising simulation schemes. In this paper, we present a new simulation scheme ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 1991
ISSN: 0888-613X
DOI: 10.1016/0888-613x(91)90028-k